Space-Limited Ranked Query Evaluation Using Adaptive Pruning
نویسندگان
چکیده
Evaluation of ranked queries on large text collections can be costly in terms of processing time and memory space. Dynamic pruning techniques allow both costs to be reduced, at the potential risk of decreased retrieval effectiveness. In this paper we describe an improved query pruning mechanism that offers a more resilient tradeoff between query evaluation costs and retrieval effectiveness than do previous pruning approaches.
منابع مشابه
New Approaches of Ranking Queries in Uncertain Databases
New applications such as sensor data monitoring and mobile device tracking, rise up the issue of uncertain data management. Compared to “certain” data, the data in the uncertain database are not exact points, which, instead, often reside within a region. Here the study ranked queries over the uncertain data. The existing system such as decision making, recommendation raising, and data mining ta...
متن کاملTree Pattern Relaxation
Tree patterns are fundamental to querying tree structured data like XML Because of the heterogeneity of XML data it is often more appropriate to permit approximate query matching and return ranked answers in the spirit of Information Retrieval than to return exact matches In this paper we study the problem of approximate XML query matching based on tree pattern relaxations and devise e cient al...
متن کاملAdaptive Predictive Controllers Using a Growing and Pruning RBF Neural Network
An adaptive version of growing and pruning RBF neural network has been used to predict the system output and implement Linear Model-Based Predictive Controller (LMPC) and Non-linear Model-based Predictive Controller (NMPC) strategies. A radial-basis neural network with growing and pruning capabilities is introduced to carry out on-line model identification.An Unscented Kal...
متن کاملRun-Time Adaptivity for Search Computing
In Search Computing, queries act over internet resources, and combine access to standard web services with exact results and to ranked search services. Such resources often provide limited statistical information that can be used to inform static query optimization, and correlations between the values and ranks associated with different resources may only become clear at query runtime. As a res...
متن کاملEfficient Compressed Inverted Index Skipping for Disjunctive Text-Queries
In this paper we look at a combination of bulk-compression, partial query processing and skipping for document-ordered inverted indexes. We propose a new inverted index organization, and provide an updated version of the MaxScore method by Turtle and Flood and a skipping-adapted version of the space-limited adaptive pruning method by Lester et al. Both our methods significantly reduce the numbe...
متن کامل